Label-based routing for a family of small-world Farey graphs
نویسندگان
چکیده
We introduce an informative labelling method for vertices in a family of Farey graphs, and deduce a routing algorithm on all the shortest paths between any two vertices in Farey graphs. The label of a vertex is composed of the precise locating position in graphs and the exact time linking to graphs. All the shortest paths routing between any pair of vertices, which number is exactly the product of two Fibonacci numbers, are determined only by their labels, and the time complexity of the algorithm is O(n). It is the first algorithm to figure out all the shortest paths between any pair of vertices in a kind of deterministic graphs. For Farey networks, the existence of an efficient routing protocol is of interest to design practical communication algorithms in relation to dynamical processes (including synchronization and structural controllability) and also to understand the underlying mechanisms that have shaped their particular structure.
منابع مشابه
Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs
We present a new category of graphs, recursive clique-trees K q t (with q 2 and t 0), which have small-world and scale-free properties and allow a fine tuning of the clustering and the power-law exponent of their discrete degree distribution. This family of graphs is a generalization of recent constructions with fixed degree distributions. We first compute the relevant characteristics of those ...
متن کاملTraveling with a Pez Dispenser (Or, Routing Issues in MPLS)
A new packet routing model proposed by the Internet Engineering Task Force is MultiProtocol Label Switching, or MPLS [B. Davie and Y. Rekhter, MPLS: Technology and Applications, Morgan Kaufmann (Elsevier), New York, 2000]. Instead of each router’s parsing the packet network layer header and doing its lookups based on that analysis (as in much of conventional packet routing), MPLS ensures that t...
متن کاملFarey graphs as models for complex networks
Farey sequences of irreducible fractions between 0 and 1 can be related to graph constructions known as Farey graphs. These graphs were first introduced by Matula and Kornerup in 1979 and further studied by Colbourn in 1982 and they have many interesting properties: they are minimally 3-colorable, uniquely Hamiltonian, maximally outerplanar and perfect. In this paper we introduce a simple gener...
متن کاملSmall - World Graphs : Models , Analysis and Applications in Network Designs
Small-world properties are common in many large-scale real-world networks such as social networks, the Internet, or biological networks. In 2000, Kleinberg produced a new model for a striking aspect of acquaintance networks: that short chains can be found using limited local information only (e.g. a search based on a first-name basis). This model added random links to a 2D grid, such that the r...
متن کاملA PFIH-Based Heuristic for Green Routing Problem with Hard Time Windows
Transportation sector generates a considerable part of each nation's gross domestic product and considered among the largest consumers of oil products in the world. This paper proposes a heuristic method for the vehicle routing problem with hard time windows while incorporating the costs of fuel, driver, and vehicle. The proposed heuristic uses a novel speed optimization algorithm to reach its ...
متن کامل